var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://www.cs.toronto.edu/~toryn/test/publications/list.bib&jsonp=1&filter=keywords:\\b(LTL|automata)\\b,keywords:\\bplanning\\b&theme=default&urlLabel=paper&groupby=&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://www.cs.toronto.edu/~toryn/test/publications/list.bib&jsonp=1&filter=keywords:\\b(LTL|automata)\\b,keywords:\\bplanning\\b&theme=default&urlLabel=paper&groupby=\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://www.cs.toronto.edu/~toryn/test/publications/list.bib&jsonp=1&filter=keywords:\\b(LTL|automata)\\b,keywords:\\bplanning\\b&theme=default&urlLabel=paper&groupby=\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n \n\n \n \n \n \n \n \n Finite LTL Synthesis as Planning.\n \n \n \n \n\n\n \n Camacho, A.; Baier, J. A.; Muise, C. J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Twenty-Eight International Conference on Automated Planning and Scheduling (ICAPS), pages 29-38, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"Finite paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 29 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{cam-bai-mui-mci-icaps18,\r\n  author    = {Alberto Camacho and\r\n               Jorge A. Baier and\r\n               Christian J. Muise and\r\n               Sheila A. McIlraith},\r\n  title     = {Finite {LTL} Synthesis as Planning},\r\n  booktitle = {Proceedings of the Twenty-Eight International Conference on\r\nAutomated Planning and Scheduling ({ICAPS})},\r\n  pages     = {29-38},\r\n  year      = {2018},\r\n  url_paper =\r\n{http://www.cs.toronto.edu/~acamacho/papers/cam-bai-mui-mci-icaps18.pdf},\r\n  keywords  = {LTL, planning}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces.\n \n \n \n \n\n\n \n Camacho, A.; Triantafillou, E.; Muise, C. J.; Baier, J. A.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI), pages 3716-3724, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Non-Deterministic paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 31 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{cam-tri-mui-bai-mci-aaai17,\r\n  author    = {Alberto Camacho and\r\n               Eleni Triantafillou and\r\n               Christian J. Muise and\r\n               Jorge A. Baier and\r\n               Sheila A. McIlraith},\r\n  title     = {Non-Deterministic Planning with Temporally Extended Goals:\r\n{LTL} over Finite and Infinite Traces},\r\n  booktitle = {Proceedings of the Thirty-First AAAI Conference on\r\nArtificial Intelligence ({AAAI})},\r\n  url_paper =\r\n{http://www.cs.toronto.edu/~sheila/publications/cam-etal-aaai17.pdf},\r\n  keywords  = {LTL, planning},\r\n  pages     = {3716-3724},\r\n  year      = {2017}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite LTL (Amended Version).\n \n \n \n \n\n\n \n Camacho, A.; Triantafillou, E.; Muise, C.; Baier, J.; and McIlraith, S. A.\n\n\n \n\n\n\n In Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI, 2016. \n A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning (HSDIP'16) at ICAPS\n\n\n\n
\n\n\n\n \n \n \"Non-Deterministicpaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{cam-etal-ltl-knowpros16,\r\n  title = {Non-Deterministic Planning with Temporally Extended Goals: Completing the story for finite and infinite {LTL} (Amended Version)},\r\n  author = {Alberto Camacho and Eleni Triantafillou and Christian Muise and Jorge Baier and Sheila A. McIlraith},\r\n  booktitle = {Workshop on knowledge-based techniques for problem solving and reasoning (KnowProS'16) at IJCAI},\r\n  year = {2016},\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/cam-etal-ltl-knowpros16.pdf},\r\n  note = {A version of this paper also appeared in the Workshop on Heuristic Search and Domain Independent Planning ({HSDIP}'16) at ICAPS},\r\nabstract={Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.},\r\n  keywords = {LTL, planning}\r\n}\r\n\r\n
\n
\n\n\n
\n Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of planning with temporally extended goals over both finite and infinite traces where actions can be non-deterministic, and where temporally extended goals are specified in linear temporal logic (LTL). Unlike existing LTL planners, we place no restrictionson our LTL formulae beyond those necessary to distinguish finite from infinite trace interpretations. We realize our planner by compiling temporally extended goals, represented in LTL, into Planning Domain Definition Language problem instances, and exploiting a state-of-the-art fully observable non-deterministic planner to compute solutions. The resulting planner is sound and complete. Our approach exploits the correspondence between LTL and automata. We propose several different compilations based on translations of LTL to (Buchi) alternating or non-deterministic finite state automata, and evaluate various properties of the competing approaches. We address a diverse spectrum of LTL planning problems that, to this point, had not been solvable using AI planning techniques. We do so while demonstrating competitive performance relative to the state of the art in LTL planning.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Unifying Framework for Planning with LTL and Regular Expressions.\n \n \n \n \n\n\n \n Triantafillou, E.; Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the Workshop on Model-Checking and Automated Planning (MOCHAP) at ICAPS, pages 23-31, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Apaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{tri-etal-mochap15,\r\n  title = {A Unifying Framework for Planning with LTL and Regular Expressions},\r\n  author = {Eleni Triantafillou and Jorge Baier and Sheila McIlraith},\r\n  booktitle = {Proceedings of the Workshop on Model-Checking and Automated Planning (MOCHAP) at ICAPS},\r\n  pages = {23-31},\r\n  year = {2015},\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/tri-etal-mochap15.pdf},\r\n  keywords = {planning, LTL, LDL}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Specifying and Computing Preferred Plans.\n \n \n \n \n\n\n \n Bienvenu, M.; Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n Artificial Intelligence, 175(7-8): 1308-1345. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"Specifyingpaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ bie-fri-mci-aij11,\r\n  volume = {175},\r\n  number = {7-8},\r\n  title = {Specifying and Computing Preferred Plans},\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/bie-fri-mci-aij11.pdf},\r\n  journal = {Artificial Intelligence},\r\n  keywords = {Planning with preferences},\r\n  pages = {1308-1345},\r\n  author = {Meghyn Bienvenu and Christian Fritz and Sheila A. McIlraith},\r\n  year = {2011},\r\n  keywords = {planning, LTL, preferences}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Heuristic Search Approach to Planning with Temporally Extended Preferences.\n \n \n \n \n\n\n \n Baier, J. A.; Bacchus, F.; and McIlraith, S. A.\n\n\n \n\n\n\n Artificial Intelligence, 173(5-6): 593-618. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"Apaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 24 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{ bai-bac-mci-aij09,\r\n  author = {Jorge A. Baier and Fahiem Bacchus and Sheila A. McIlraith},\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/bai-bac-mci-aij09.pdf},\r\n  journal = {Artificial Intelligence},\r\n  title = {A Heuristic Search Approach to Planning with Temporally Extended Preferences},\r\n  number = {5-6},\r\n  volume = {173},\r\n  year = {2009},\r\n  pages = {593-618},\r\n  keywords = {LTL, planning, preferences}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners.\n \n \n \n \n\n\n \n Baier, J. A.; Fritz, C.; Bienvenu, M.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI), Nectar Track, pages 1509-1512, Chicago, Illinois, USA, July 13-17 2008. \n \n\n\n\n
\n\n\n\n \n \n \"Beyondpaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{ bai-fri-bie-mci-aaai08nectar,\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/bai-fri-bie-mci-aaai08nectar.pdf},\r\n  author = \t {Jorge A. Baier and Christian Fritz and Meghyn Bienvenu and Sheila McIlraith},\r\n  title = \t {Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners},\r\n  booktitle =\t {Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI), Nectar Track},\r\n  year =\t 2008,\r\n  address =\t {Chicago, Illinois, USA},\r\n  month =\t {July 13-17},\r\n  pages =\t {1509-1512},\r\n  keywords = {planning, LTL, preferences}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners.\n \n \n \n \n\n\n \n Baier, J. A.; Fritz, C.; and McIlraith, S. A.\n\n\n \n\n\n\n In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS-07), pages 144-151, Providence, Rhode Island, September 22 - 26 2007. \n \n\n\n\n
\n\n\n\n \n \n \"Exploitingpaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{ bai-fri-mci-icaps07,\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/bai-fri-mci-icaps07.pdf},\r\n  author = \t {Jorge A. Baier and Christian Fritz and Sheila A. McIlraith},\r\n  title = \t {Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners},\r\n  booktitle = {Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS-07)},\r\n  year = \t 2007,\r\n  pages =       {144-151},\r\n  address = \t {Providence, Rhode Island},\r\n  month = \t {September 22 - 26},\r\n  keywords = {planning, automata}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with First-Order Temporally Extended Goals Using Heuristic Search.\n \n \n \n \n\n\n \n Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI06), pages 788-795, Boston, MA, July 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Planningpaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{bai-mci-aaai06,\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/bai-mci-aaai06.pdf},\r\n  author = {Baier, J. and McIlraith, S.},\r\n  title = {Planning with First-Order Temporally Extended Goals Using Heuristic Search},\r\n  booktitle = {Proceedings of the 21st National Conference on Artificial Intelligence (AAAI06)},\r\n  address = {Boston, MA},\r\n  month   = {July},\r\n  pages = {788-795},\r\n  year = 2006,\r\n  keywords = {LTL, planning}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Planning with Temporally Extended Goals Using Heuristic Search.\n \n \n \n \n\n\n \n Baier, J.; and McIlraith, S.\n\n\n \n\n\n\n In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS06), pages 342-345, Lake District, UK, June 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Planningpaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 24 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{ bai-mci-icaps06,\r\n  url = {https://www.cs.toronto.edu/~sheila/publications/bai-mci-icaps06.pdf},\r\n  author = {Baier, J. and McIlraith, S.},\r\n  title = {Planning with Temporally Extended Goals Using Heuristic Search},\r\n  booktitle = {Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS06)},\r\n  year = 2006,\r\n  address = {Lake District, UK},\r\n  pages = {342-345},\r\n  month   = {June},\r\n  keywords = {planning, LTL}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);